Approximate Nearest Neighbor Search for a Dataset of Normalized Vectors
نویسندگان
چکیده
منابع مشابه
Approximate Nearest Neighbor Search for a Dataset of Normalized Vectors
This paper describes a novel algorithm for approximate nearest neighbor searching. For solving this problem especially in high dimensional spaces, one of the best-known algorithm is Locality-Sensitive Hashing (LSH). This paper presents a variant of the LSH algorithm that outperforms previously proposed methods when the dataset consists of vectors normalized to unit length, which is often the ca...
متن کاملComposite Quantization for Approximate Nearest Neighbor Search
This paper presents a novel compact coding approach, composite quantization, for approximate nearest neighbor search. The idea is to use the composition of several elements selected from the dictionaries to accurately approximate a vector and to represent the vector by a short code composed of the indices of the selected elements. To efficiently compute the approximate distance of a query to a ...
متن کاملFast Approximate Nearest-Neighbor Search with k-Nearest Neighbor Graph
We introduce a new nearest neighbor search algorithm. The algorithm builds a nearest neighbor graph in an offline phase and when queried with a new point, performs hill-climbing starting from a randomly sampled node of the graph. We provide theoretical guarantees for the accuracy and the computational complexity and empirically show the effectiveness of this algorithm.
متن کاملHardness of Approximate Nearest Neighbor Search
We prove conditional near-quadratic running time lower bounds for approximate Bichromatic Closest Pair with Euclidean, Manhattan, Hamming, or edit distance. Specifically, unless the Strong Exponential Time Hypothesis (SETH) is false, for every δ > 0 there exists a constant ε > 0 such that computing a (1 + ε)-approximation to the Bichromatic Closest Pair requires Ω (
متن کاملApproximate Nearest Neighbor Search in $\ell_p$
We present a new locality sensitive hashing (LSH) algorithm for c-approximate nearest neighbor search in lp with 1 < p < 2. For a database of n points in lp, we achieve O(dn ) query time and O(dn + n) space, where ρ ≤ O((ln c)/c). This improves upon the previous best upper bound ρ ≤ 1/c by Datar et al. (SOCG 2004), and is close to the lower bound ρ ≥ 1/c by O’Donnell, Wu and Zhou (ITCS 2011). T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2009
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e92.d.1609